Structured decompositions for matrix triples: SVD-like concepts for structured matrices
نویسندگان
چکیده
Canonical forms for matrix triples (A,G, Ĝ), where A is arbitrary rectangular andG, Ĝare either real symmetric or skew symmetric, or complex Hermitian or skew Hermitian, arederived. These forms generalize classical singular value decompositions. In [1] a similarcanonical form has been obtained for the complex case. In this paper, we provide analternative proof for the complex case which is based on the construction of a staircase-like form with the help of a structured QR-like decomposition. This approach allowsgeneralization to the real case.
منابع مشابه
Estimating a Few Extreme Singular Values and Vectors for Large-Scale Matrices in Tensor Train Format
We propose new algorithms for singular value decomposition (SVD) of very large-scale matrices based on a low-rank tensor approximation technique called the tensor train (TT) format. The proposed algorithms can compute several dominant singular values and corresponding singular vectors for large-scale structured matrices given in a TT format. The computational complexity of the proposed methods ...
متن کاملMultilinear Singular Value Decomposition for Structured Tensors
The Higher-Order SVD (HOSVD) is a generalization of the Singular Value Decomposition (SVD) to higher-order tensors (i.e. arrays with more than two indices) and plays an important role in various domains. Unfortunately, this decomposition is computationally demanding. Indeed, the HOSVD of a third-order tensor involves the computation of the SVD of three matrices, which are referred to as "modes"...
متن کاملAn Accelerated Divide-and-Conquer Algorithm for the Bidiagonal SVD Problem
In this paper, aiming at solving the bidiagonal SVD problem, a classical divide-andconquer (DC) algorithm is modified, which needs to compute the SVD of broken arrow matrices by solving secular equations. The main cost of DC lies in the updating of singular vectors, which involves two matrix-matrix multiplications. We find that the singular vector matrices of a broken arrow matrix are Cauchy-li...
متن کاملAn SVD-free Approach to a Class of Structured Low Rank Matrix Optimization Problems with Application to System Identification
We present an algorithm to solve a structured low rank matrix optimization problem based on the nuclear norm. We represent the desired structure by a linear map, termed mutation, that we characterize and use in our algorithm. Contrary to alternative techniques for structured low rank matrices, the algorithm is SVD-free, which leads to improved scalability. The idea relies on restating the nucle...
متن کاملNew Approach for the Inversion of Structured Matrices via Newton’s Iteration
Newton’s iteration is a fundamental tool for numerical solutions of systems of equations. The well-known iteration ( ) 1 2 , 0 i i i X X I MX i + = − ≥ rapidly refines a crude initial approximation 0 X to the inverse of a general nonsingular matrix. In this paper, we will extend and apply this method to n n × structured matrices M , in which matrix multiplication has a lower computational cost....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008